Accelerating consensus of self-driven swarm via adaptive speed
نویسندگان
چکیده
منابع مشابه
Accelerating consensus of self-driven swarm via adaptive speed
In resent years, Vicsek model has attracted extensive attention and been well developed. However, the in-depth analysis on convergent time are scarce thus far. In this paper, we study the factors that influence the convergent time of Vicsek model at zero temperature. Furthermore, to accelerate the convergence, we propose a new model in which the speed of each particle is variable. Convergent ti...
متن کاملAccelerating parallel particle swarm optimization via GPU
This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date...
متن کاملAccelerating Approximate Consensus with Self-Organizing Overlays
Laplacian-based approximate consensus algorithms are an important and frequently used building block in many distributed applications, including formation control, sensor fusion, and synchronization. These algorithms, however, converge extremely slowly on networks that are more than a few hops in diameter and where values are spatially correlated. This paper presents a new algorithm, Power Law ...
متن کاملAccelerating Optimization via Adaptive Prediction
We present a powerful general framework for designing data-dependent optimization algorithms, building upon and unifying recent techniques in adaptive regularization, optimistic gradient predictions, and problemdependent randomization. We first present a series of new regret guarantees that hold at any time and under very minimal assumptions, and then show how different relaxations recover exis...
متن کاملAccelerating Online Convex Optimization via Adaptive Prediction
We present a powerful general framework for designing data-dependent online convex optimization algorithms, building upon and unifying recent techniques in adaptive regularization, optimistic gradient predictions, and problem-dependent randomization. We first present a series of new regret guarantees that hold at any time and under very minimal assumptions, and then show how different relaxatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2009
ISSN: 0378-4371
DOI: 10.1016/j.physa.2008.11.043